The Study of the Longest Non - Intersecting Route Problem Using Self - Organizing Neural Networks

Self-organizing neural networks have topological characteristics that can be effectively used in solving the traveling salesman problem. In this paper we propose a novel problem of maximizing the length of a non-intersecting closed route in which each node, except for the starting point, is only visited once. The self-organizing network algorithm of the traveling salesman problem is modified to solve the problem. In the process, some theorems regarding the intersection of two line segments are presented. Simulation results show that our proposed algorithm performs well on the optimization of the length of the route.